Linear Advice for Randomized Logarithmic Space
نویسندگان
چکیده
We show that RL ⊆ L/O(n), i.e., any language computable in randomized logarithmic space can be computed in deterministic logarithmic space with a linear amount of non-uniform advice. To prove our result we use an ultra-low space walk on the Gabber-Galil expander graph due to Gutfreund and Viola. ∗Work done while at TTI-Chicago.
منابع مشابه
Solving Laplacian Systems in Logarithmic Space
We investigate the space complexity of solving linear systems of equations. While all known deterministic or randomized algorithms solving a square system of n linear equations in n variables require Ω(log 2 n) space, Ta-Shma (STOC 2013) recently showed that on a quantum computer an approximate solution can be computed in logarithmic space, giving the first explicit computational task for which...
متن کاملSpace Hierarchy Results for Randomized Models
We prove space hierarchy and separation results for randomized and other semantic models of computation with advice. Previous works on hierarchy and separation theorems for such models focused on time as the resource. We obtain tighter results with space as the resource. Our main theorems are the following. Let s(n) be any spaceconstructible function that is Ω(log n) and such that s(an) = O(s(n...
متن کاملAlmost Online Square Packing
In the square packing problem, the goal is to pack squares of different sizes into the smallest number of bins (squares) of uniform size. We introduce an almostonline square packing algorithm which places squares in an online, sequential manner. In doing so, it receives advice of logarithmic size from an offline oracle which runs in linear time. Our algorithm achieve a competitive ratio of at m...
متن کاملA Note on the Advice Complexity of Multipass Randomized Logspace
Investigating the complexity of randomized space-bounded machines that are allowed to make multiple passes over the random tape has been of recent interest. In particular, it has been shown that derandomizing such probabilistic machines yields a weak but new derandomization of probabilistic time-bounded classes. In this paper we further explore the complexity of such machines. In particular, as...
متن کاملA little advice can be very helpful
Proving superpolylogarithmic lower bounds for dynamic data structures has remained an open problem despite years of research. Recently, Pǎtraşcu proposed an exciting new approach for breaking this barrier via a two player communication model in which one player gets private advice at the beginning of the protocol. He gave reductions from the problem of solving an asymmetric version of set-disjo...
متن کامل